Comparison of Efficiency Measures of Non-Priority and Non-Pre-Emptive Priority Queues
نویسندگان
چکیده
منابع مشابه
Theoretical and practical efficiency of priority queues
This is a study of the theoretical and practical efficiency of priority queues. The priority queue is an old and well studied data structure on which a great deal of theoretical and practical work has already been done. A priority queue can be realised in many ways, some of the most commonly used data structures for this are binary heaps and binomial queues. In this thesis the efficiency of pri...
متن کاملQuantifying the Sub-optimality of Uniprocessor Fixed Priority Non-Pre-emptive Scheduling
This paper examines the relative effectiveness of fixed priority non-pre-emptive scheduling (FP-NP) in a uniprocessor system, compared to an optimal workconserving non-pre-emptive algorithm; Earliest Deadline First (EDF-NP). The quantitative metric used in this comparison is the processor speedup factor, defined as the factor by which processor speed needs to increase to ensure that any taskset...
متن کاملcommuting and non -commuting graphs of finit groups
فرض کنیمg یک گروه غیر آبلی متناهی باشد . گراف جابجایی g که با نماد نمایش داده می شود ،گرافی است ساده با مجموعه رئوس که در آن دو راس با یک یال به هم وصل می شوند اگر و تنها اگر . مکمل گراف جابجایی g راگراف نا جابجایی g می نامیم.و با نماد نشان می دهیم. گرافهای جابجایی و ناجابجایی یک گروه متناهی ،اولین بار توسطاردوش1 مطرح گردید ،ولی در سالهای اخیر به طور مفصل در مورد بحث و بررسی قرار گرفتند . در ،م...
15 صفحه اولAnalysis of hierarchical fixed-priority pre-emptive scheduling revisited
This paper revisits worst-case response time analysis of real-time tasks under hierarchical fixed-priority preemptive scheduling. Using an example consisting of a single server and a single hard real-time task, we show that existing worst-case response time analysis can be improved for deferrable servers and sporadic servers when a server is exclusively used for hard real-time tasks. Moreover, ...
متن کاملOptimal Policies for Multi-server Non-preemptive Priority Queues
We consider a multi-server non-preemptive queue with high and low priority customers, and a decision maker who decides when waiting customers may enter service. The goal is to minimize the mean waiting time for high-priority customers while keeping the queue stable. We use a linear programming approach to find and evaluate the performance of an asymptotically optimal policy in the setting of ex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of International Scientific Researches
سال: 2021
ISSN: 2458-8725
DOI: 10.23834/isrjournal.886183